Analysis of Multimedia Traac Queues with Finite Buuer and Overload Control, Part Ii: Applications

نویسندگان

  • Jingdong Ye
  • San-qi Li
چکیده

An ATM-type multiplexer, with nite buuer and multimedia traac input, is investigated for packet loss and delay. It can also be subject to input rate regulation, overload control, and dynamic allocation of transmission bandwidth. This system model is fundamental to the ATM design, but has not been analyzed satisfactorily. In 1], an eecient and versatile technique, the folding algorithm, is developed for analyzing the QBD model of the multiplexer. The algorithm exploits the QBD structure to achieve its eeciency. In the current paper, we apply the folding algorithm to study various queueing phenomena related to an ATM multiplexer. We examine how the diierent system parameters aaect the packet loss and queueing delay, and show the performance improvements by overload controls. We also analyze the queueing performance under diierent dynamic resource allocation policies. These analyses provide important insights for the ATM design. This paper emphasizes the wide applicability of the folding algorithm by including many practical examples, whose complexities far exceed those found in the literature. A set of highly eeective approximation techniques are also proposed to further extend the folding algorithm's application range.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Discrete-time Analysis of a Finite Buuer with Vbr Mpeg Video Traac Input

Currently, a lot of interest is paid to multimedia traac in general and to video traac in particular. Most of the studies deal with appropriate models for this complex type of traac and use trace-driven simulations to assess the performance of high-speed networks carrying this type of traac. In contrast, we develop two models of diierent correlation complexity and apply them in a discrete-time ...

متن کامل

Proactive Cooperative Scheduling and Buuer Management for Multimedia Networks Proactive Cooperative Scheduling and Buuer Management for Multimedia Networks

Is it possible, and to what extent feasible, for link schedulers and buuer managers in multimedia networks with propagation delays to eeectively relieve congestion by means of feedback signalling? We show that a proactive, cooperative control algorithm for distributed resource scheduling and buuer management of multime-dia networks based on traac predictions of correlated input traac streams in...

متن کامل

Loss Correlation for Queues with Bursty Input Streams

The loss probability of a queueing system provides, in many cases , insuucient information for performance evaluation, for example , of data link layer protocols and applications with forward error correction. This paper evaluates and characterizes the correlation between packet losses for two queueing systems in discrete time that are motivated by BISDN applications. The rst, a two-class discr...

متن کامل

Loss Correlation for Queues with Single and Multiple Input

The loss probability of a queueing system provides in many cases insuucient information for performance evaluation, for example, of le transfer retransmission protocols and real-time applications with signal reconstruction. This paper evaluates and characterizes the correlation between packet losses for three queu-eing systems in discrete time that are motivated by BISDN applications. In the rs...

متن کامل

An E cient and Accurate Decomposition Method for OpenFinite - and In

We address a decomposition approach for the evaluation of large, open networks of mixed nite-and innnite-buuer queues with phase-type distributed service and interarrival times. Such queueing networks can be seen as high-level speciications of continuous-time Markov chains (CTMCs). However, these CTMCs can either become very large (in case all buuers are nite) or even become innnitely large (in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1991